منابع مشابه
Gadgets, Approximation, and Linear Programming (extended abstract)
We present a linear-programming based method for nding \gadgets", i.e., combinatorial structures reducing constraints of one optimization problems to constraints of another. A key step in this method is a simple observation which limits the search space to a nite one. Using this new method we present a number of new, computer-constructed gadgets for several different reductions. This method als...
متن کاملAbstract Categorial Parsing as Linear Logic Programming
This paper shows how the parsing problem for general Abstract Categorial Grammars can be reduced to the provability problem for Multiplicative Exponential Linear Logic. It follows essentially a similar reduction by Kanazawa, who has shown how the parsing problem for second-order Abstract Categorial Grammars reduces to datalog queries.
متن کاملLinear Logic as Logic Programming: An Abstract
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic re nement, Lolli [13], provide for various forms of abstraction (modules, abstract data types, and higher-order programming) but lack primitives for concurrency. The logic programming language, LO (Linear Objects) [2] ...
متن کاملLinear Programming - Randomization and Abstract Frameworks
Recent years have brought some progress in the knowledge of the complexity of linear programming in the unit cost model, and the best result known at this point is a randomized ‘combinatorial’ algorithm which solves a linear program over d variables and n constraints with expected O(dn + e √ d log ) arithmetic operations. The bound relies on two algorithms by Clarkson, and the subexponential al...
متن کاملAbstract Interpretation of Linear Logic Programming
Linear Logic is gaining momentum in computer science because it ooers a uniied framework and a common vocabulary for studying and analyzing diierent aspects of programming and computation. We focus here on models where computation is identiied with proof search in the sequent system of Linear Logic. A proof normalization procedure, called \focusing", has been proposed to make the problem of pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2020
ISSN: 1077-8926
DOI: 10.37236/7718